Canonical Representation of Partial 2- and 3-Trees
نویسندگان
چکیده
We give linear time algorithms constructing canonical representations of partial 2-trees (series-parallel graphs) and partial 3-trees.
منابع مشابه
Canonical Representations of Partial 2-and 3-trees
We give algorithms constructing canonical representations of partial 2-trees (series parallel graphs) and partial 3-trees. The algorithms can be implemented in log-linear space, or in linear time using quadratic space. C R categories." G.2.2.
متن کاملCanonical representation for approximating solution of fuzzy polynomial equations
In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness.
متن کاملCuntz-krieger Algebras and a Generalization of Catalan Numbers
We first observe that the relations of the canonical generating isometries of the Cuntz algebra ON are naturally related to the N-colored Catalan numbers. For a directed graph G, we generalize the Catalan numbers by using the canonical generating partial isometries of the Cuntz-Krieger algebra O AG for the transition matrix A of G. The generalized Catalan numbers cGn , n = 0, 1, 2, . . . enumer...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملCalculating the Degree Distance of Partial Hamming Graphs
If G is a connected graph with vertex set V (G), then the degree distance of G is defined as DD(G) = ∑ {u,v}∈V (G)(deg u + deg v)d(u, v), where deg u is the degree of vertex u, and d(u, v) denotes the distance between u and v. In the chemical literature, DD(G) is better known under ‡Corresponding author. If possible, send your correspondence via e-mail. the name Schultz index. In the class of p...
متن کامل